The L 10 logic programming language
نویسندگان
چکیده
We present the preliminary design of L10, a rich forward-chaining (a.k.a. “bottom-up”) logic programming language. L10 allows parallel computation to be explicitly specified through the use of worlds, a logically-motivated concept that has been used to describe distributed functional programming. An interpreter for L10 runs these logic programs on top of the infrastructure of the X10 programming language, and is responsible for mapping between L10’s worlds and places, the related X10 construct for describing distributed computation.
منابع مشابه
Design and PLC Implementation for Speed Control of DC Motor using Fuzzy Logic
In this article, a speed control of DC motor is designed and illustrated using fuzzy logic-based programmable logic controller (PLC). The DC motor is an attractive part of electrical equipment in many industrial applications requiring variable speed and load specifications due to its ease of controllability. The designed system is consisted of three main parts including programmable logic contr...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملConcurrency and Backtracking in V Ienna P Arallel L Ogic Concurrency and Backtracking in V Ienna P Arallel L Ogic
Vienna Parallel Logic (V P L) is a persistent language and programming system that supports the concurrent execution of communicating processes and the computation of several alternative solutions by means of programmed backtracking. It uniies the worlds of sequential logic programming languages (Prolog) and concurrent logic programming languages (i.e., Parlog). Aspects of both language classes...
متن کاملA Strong Logic Programming View for Static Embedded Implications
A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any program P (viewed as a L-theory) has a canonical model MP which is initial in the category of all its L-models; secondly, the L-satisfaction of a goal G in MP is equivalent to the L-derivability of G from P , and finally, there exi...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملA Logic Programming Language with Lambda - Abstraction , Function Variables , and Simple Uni cationDale
It has been argued elsewhere that a logic programming language with function variables and-abstractions within terms makes a good meta-programming language, especially when an object-language contains notions of bound variables and scope. The Prolog logic programming language and the related Elf and Isabelle systems provide meta-programs with both function variables and-abstractions by containi...
متن کامل